Performance of a Packet Switch with Shared Buffer and Input Queueing
نویسنده
چکیده
High performance of advanced packet switches can be achieved by providing queueing both at the input ports as well as at the output ports. This paper considers such a switch where output buffer sharing is introduced. A better memory utilization is expected when the output queueing space is shared among all the output ports as opposed to having dedicated queues at each output port. An analytical approach is presented for the performance study of this new scheme. The investigation is based on two performance measures: the average delay and the maximum throughput of the switch. Analytic results for these measures are derived. It is demonstrated that the scheme of output sharing offers significant improvements over the scheme of dedicated output queueing. It is found that the total output queueing space can be reduced by 70 percent, or more, while maintaining the same performance as in the scheme with dedicated output queues.
منابع مشابه
Analysis of packet switches with input and output queuing
For advanced packet switches, output queueing has received increased attention owing to its performance advantages. However, practical output queue size limitations may require additional queueing at the inputs. This paper considers a single-stage nonblocking N x N packet switch with both output and input queueing. The limited queueing at the output ports resolves output port contention partial...
متن کاملMulti-wavelength switching in IP optical nodes adopting different buffering strategies
The paper addresses the topic of long-haul optical networking for the provision of large-bandwidth IP services. A class of optical packet switching architectures is considered which adopts an arrayed wavelength grating device as packet router. The architecture performs slotted packet switching operations and fully exploits the wavelength routing capabilities by allowing multi-wavelength switchi...
متن کاملPerformance Analysis of Cell and Packet Switch with Finite Input Queues and Ilpf Scheduling Algorithm
In this paper, packet loss probability performance in cell-based and packet-based switches with finite Input Queues (IQ) and iLPF scheduling algorithm are analysed. This algorithm has been proposed as a practical scheduling algorithm to achieve 100% throughput in cell-based switches. The scheduling algorithm is implemented in three cases: cellbased (CB-iLPF) switching, packet-based (PB-iLPF) sw...
متن کاملBuffer Management in the Sliding-Window (SW) Packet Switch for Priority Switching
Switch and router architectures employing a shared buffer are known to provide high throughput, low delay, and high memory utilization. Superior performance of a shared-memory switch compared to switches employing other buffer strategies can be achieved by carefully implementing a buffer-management scheme. A buffer-sharing policy should allow all of the output interfaces to have fair and robust...
متن کاملPerformance Evaluation of Input Queued Buffered Sparse-Crossbar Packet Concentrators
In this paper, we study the performance of packet concentrators with input queueing. A recent concentrator model given by Gündüzhan and Oruç considers packet concentrators with different input and output packet rates and gives a minimum crosspoint complexity construction for buffered sparse crossbar concentrators. We use this model as a basis for the performance evaluation of concentrators whic...
متن کامل